Claw-free t-perfect graphs can be recognised in polynomial time

摘要

A graph is called t-perfect if its stable set polytope is defined bynon-negativity, edge and odd-cycle inequalities. We show that it can be decidedin polynomial time whether a given claw-free graph is t-perfect.